#include "../Basics/BasicStruct.cpp"

// 线索二叉树
TreeNode* getPre(TreeNode* root) {
    if(root->leftTag == 0) {
        return root->leftChild;
    } else{
        return root->rightChild;
    }
}

int main() {

}